Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been...(展开全部)

A text for a second course in logic for graduate and advanced undergraduate students. This third edition has been corrected and contains thoroughly revised versions of the chapters on Ramsey and provability, with new exercises provided for three other chapters. There are also two new chapters dealing with undecidable sentences and on the non-existence of non-standard recursive ...(展开全部)

Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been...(展开全部)

Now in its fourth edition, this book has become a classic because of its accessibility to students without a mathematical background, and because it covers not only the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has enha...(展开全部)

Classic text considers general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.

The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computab...(展开全部)

保罗·蒂德曼（Paul Tidman,1956— ），美国俄亥俄州尤宁山大学（University of Mount Union）哲学与宗教学系教授。主要研究方向为逻辑学、认识论、形而上学及应用伦理学。 霍华德·卡哈尼（Howard Kahane,1928—2001）,美国著名逻辑教育家，曾先后任教于堪萨斯大学、马里兰大学等。主要代表作：《逻辑与哲学：现代逻辑导论》（1969年第一版，至第六版为独立作者，以后各版与他人合作），《六个归纳问题》（1962年），《逻辑与当代修辞学》（1971年），《契约伦理学》（1995年）。

保罗·蒂德曼（Paul Tidman,1956— ），美国俄亥俄州尤宁山大学（University of Mount Union）哲学与宗教学系教授。主要研究方向为逻辑学、认识论、形而上学及应用伦理学。 霍华德·卡哈尼（Howard Kahane,1928—2001）,美国著名逻辑教育家，曾先后任教于堪萨斯大学、马里兰大学等。主要代表作：《逻辑与哲学：现代逻辑导论》（1969年第一版，至第六版为独立作者，以后各版与他人合作），《六个归纳问题》（1962年），《逻辑与当代修辞学》（1971年），《契约伦理学》（1995年）。

Fascinating study considers the origins and nature of mathematics, its development and role in the history of scientific thinking, impact of high-speed computers, 20th-century changes in the foundations of mathematics and mathematical logic, mathematization of science and technology, much more. Compelling reading for anyone interested in the evolution of mathematical thought. I...(展开全部)